Gradient Flow Methods for Matrix Completion with Prescribed Eigenvalues
نویسندگان
چکیده
Abstract. Matrix completion with prescribed eigenvalues is a special type of inverse eigenvalue problems. The goal is to construct a matrix subject to the structural constraint of prescribed entries and the spectral constraint of prescribed spectrum. The challenge of such a completion problem lies in the intertwining of the cardinality and the location of the prescribed entries so that the inverse problem is solvable. An intriguing question is whether matrices can have arbitrary entries at arbitrary locations with arbitrary eigenvalues and how to complete such a matrix. Constructive proofs exist to a certain point (and those proofs, such as the classical Schur-Horn theorem, are amazingly elegant enough in their own right) beyond which very few theories or numerical algorithms are available. In this paper the completion problem is recast as the one of minimizing the distance between the isospectral matrices with the prescribed eigenvalues and the affined matrices with the prescribed entries. The gradient flow is proposed as a numerical means to tackle the construction. This approach is general enough that it can be used to explore the existence question when the prescribed entries are at arbitrary locations with arbitrary cardinalities.
منابع مشابه
On robust matrix completion with prescribed eigenvalues
Matrix completion with prescribed eigenvalues is a special kind of inverse eigenvalue problems. Thus far, only a handful of specific cases concerning its existence and construction have been studied in the literature. The general problem where the prescribed entries are at arbitrary locations with arbitrary cardinalities proves to be challenging both theoretically and computationally. This pape...
متن کاملLocalization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix
This paper is concerned with the problem of designing discrete-time control systems with closed-loop eigenvalues in a prescribed region of stability. First, we obtain a state feedback matrix which assigns all the eigenvalues to zero, and then by elementary similarity operations we find a state feedback which assigns the eigenvalues inside a circle with center and radius. This new algorithm ca...
متن کاملA generalisation of the Oja subspace flow
Recently, a novel flow for computing the eigenvectors associated with the smallest eigenvalues of a symmetric but not necessarily positive definite matrix was introduced. This meant that the eigenvectors associated with the smallest eigenvalues could be found simply by reversing the sign of the matrix. The current paper derives a cost function and the corresponding negative gradient flow which ...
متن کاملNew Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کامل